Algorithms for quaternion polynomial root-finding
نویسندگان
چکیده
منابع مشابه
Polynomial Root-Finding Algorithms and Branched Covers
Introduction. The problem of devising optimal methods for numerically approximating the roots of a polynomial has been of interest for several centuries, and is far from solved. There are numerous recent works on root-finding algorithms and their cost, for example, the work of Jenkins and Traub [JT70], Renegar [Ren87], Schönhage [Sch82], and Shub and Smale [SS85, SS86, Sma85]. This list is far ...
متن کاملRoot-finding and Root-refining for a Polynomial Equation
Polynomial root-finders usually consist of two stages. At first a crude approximation to a root is slowly computed; then it is much faster refined by means of the same or distinct iteration. The efficiency of computing an initial approximation resists formal study, and the users rely on empirical data. In contrast, the efficiency of refinement is formally measured by the classical concept q whe...
متن کاملGenetic Algorithms for Finding Polynomial Orderings
Polynomial orderings are a well-known method to prove termination of term rewriting systems. However, for an automation of this method, the crucial point is to find suitable coefficients by machine. We present a novel approach for solving this problem by applying genetic algorithms.
متن کاملTwo Algorithms for Root Finding in
We present two algorithms for computing the root, or equivalently the xed point, of a function in exact real arithmetic. The rst algorithm uses the iteration of the expression tree representing the function in real arithmetic based on linear fractional transformations and exact oating point. The second and more general algorithm is based on a trisection of intervals and can be compared with the...
متن کاملAccurate polynomial root-finding methods for symmetric tridiagonal matrix eigenproblems
In this paper we consider the application of polynomial root-finding methods to the solution of the tridiagonal matrix eigenproblem. All considered solvers are based on evaluating the Newton correction. We show that the use of scaled three-term recurrence relations complemented with error free transformations yields some compensated schemes which significantly improve the accuracy of computed r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 2013
ISSN: 0885-064X
DOI: 10.1016/j.jco.2013.03.001